Performance and Productivity in Parallel Programming via Processor Virtualization
نویسنده
چکیده
We have been pursuing a research program aimed at enhancing productivity and performance in parallel computing at the Parallel Programming Laboratory of University of Illinois for the past decade. We summarize the basic approach, and why it has improved (and will further improve) both productivity and performance. The centerpiece of our approach is a technique called processor virtualization: the program computation is divided into a large number of chunks (called virtual processors), which are mapped to processors by an adaptive, intelligent runtime system. The runtime system also controls communication between virtual processors. This approach makes possible a number of runtime optimizations. We argue that the following strategies are necessary to improve productivity in parallel programming: • Automated resource management via processor virtualization • Modularity via concurrent composability • Reusability via frameworks, libraries, and multiparadigm interoperability Of these, the first two directly benefit from processor virtualization, while the last is indirectly impacted. We describe our research on all these fronts.
منابع مشابه
A Parallel Multigrid Solver Based on Processor Virtualization
We investigate the use of the processor virtualization technique in parallelizing the multigrid algorithm on high performance computers. By doing processor virtualization, we can achieve adaptive process overlapping, better cache performance, and dynamic load balance control. We use a neighbor based virtual processor to physical processor mapping strategy and dynamically changing the number of ...
متن کاملApplication-Specific System Customization on Many-Core Platforms: The VT-ASOS Framework Position paper
Dense shared-memory multiprocessors built with several interconnected multi-core chips, a computer organization which was recently coined as a manycore system, are emerging as a dominant architectural paradigm in high-performance computing. As many-core systems will scale to tens of cores in 2007 and hundreds of cores in the near future, effective resource allocation and scalability across the ...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملEfficient Resource Sharing Through GPU Virtualization on Accelerated High Performance Computing Systems
The High Performance Computing (HPC) field is witnessing a widespread adoption of Graphics Processing Units (GPUs) as co-processors for conventional homogeneous clusters. The adoption of prevalent SingleProgram Multiple-Data (SPMD) programming paradigm for GPU-based parallel processing brings in the challenge of resource underutilization, with the asymmetrical processor/co-processor distributio...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004